Bin Packing with Rejection RevisitedEPSTEIN, Leah.Algorithmica. 2010, Vol 56, Num 4, pp 505-528, issn 0178-4617, 24 p.Article

Equilibria for two parallel links: the strong price of anarchy versus the price of anarchyEPSTEIN, Leah.Acta informatica. 2010, Vol 47, Num 7-8, pp 375-389, issn 0001-5903, 15 p.Article

Online bin packing with cardinality constraintsEPSTEIN, Leah.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 4, pp 1015-1030, issn 0895-4801, 16 p.Article

Online bin packing with cardinality constraintsEPSTEIN, Leah.Lecture notes in computer science. 2005, pp 604-615, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Bin stretching revisitedEPSTEIN, Leah.Acta informatica. 2003, Vol 39, Num 2, pp 97-117, issn 0001-5903, 21 p.Article

Online variable sized coveringEPSTEIN, Leah.Information and computation (Print). 2001, Vol 171, Num 2, pp 294-305, issn 0890-5401Article

A note on on-line scheduling with precedence constraints on identical machinesEPSTEIN, Leah.Information processing letters. 2000, Vol 76, Num 4-6, pp 149-153, issn 0020-0190Article

Two-dimensional online bin packing with rotationEPSTEIN, Leah.Theoretical computer science. 2010, Vol 411, Num 31-33, pp 2899-2911, issn 0304-3975, 13 p.Article

Tight bounds for bandwidth allocation on two linksEPSTEIN, Leah.Discrete applied mathematics. 2005, Vol 148, Num 2, pp 181-188, issn 0166-218X, 8 p.Article

Selfish Bin PackingEPSTEIN, Leah; KLEIMAN, Elena.Algorithmica. 2011, Vol 60, Num 2, pp 368-394, issn 0178-4617, 27 p.Article

Maximizing the minimum load for selfish agentsEPSTEIN, Leah; VAN STEE, Rob.Theoretical computer science. 2010, Vol 411, Num 1, pp 44-57, issn 0304-3975, 14 p.Article

A robust APTAS for the classical bin packing problemEPSTEIN, Leah; LEVIN, Asaf.Mathematical programming (Print). 2009, Vol 119, Num 1, pp 33-49, issn 0025-5610, 17 p.Article

Resource augmented semi-online bounded space bin packingEPSTEIN, Leah; KLEIMAN, Elena.Discrete applied mathematics. 2009, Vol 157, Num 13, pp 2785-2798, issn 0166-218X, 14 p.Article

The conference call search problem in wireless networksEPSTEIN, Leah; LEVIN, Asaf.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 418-429, issn 0304-3975, 12 p.Article

Optimal non-preemptive semi-online scheduling on two related machinesEPSTEIN, Leah; FAVRHOLDT, Lene M.Journal of algorithms (Print). 2005, Vol 57, Num 1, pp 49-73, issn 0196-6774, 25 p.Article

Bin packing with general cost structuresEPSTEIN, Leah; LEVIN, Asaf.Mathematical programming (Print). 2012, Vol 132, Num 1-2, pp 355-391, issn 0025-5610, 37 p.Article

On Equilibria for ADM Minimization GamesEPSTEIN, Leah; LEVIN, Asaf.Algorithmica. 2012, Vol 63, Num 1-2, pp 246-273, issn 0178-4617, 28 p.Article

Bin packing with controllable item sizesCORREA, José R; EPSTEIN, Leah.Information and computation (Print). 2008, Vol 206, Num 8, pp 1003-1016, issn 0890-5401, 14 p.Article

AN APTAS FOR GENERALIZED COST VARIABLE-SIZED BIN PACKINGEPSTEIN, Leah; LEVIN, Asaf.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 411-428, issn 0097-5397, 18 p.Article

SONET ADMs minimization with divisible pathsEPSTEIN, Leah; LEVIN, Asaf.Algorithmica. 2007, Vol 49, Num 1, pp 51-68, issn 0178-4617, 18 p.Article

Minimizing the maximum starting time on-lineEPSTEIN, Leah; VAN STEE, Rob.Report - Software engineering. 2001, Num 33, pp 1-13, issn 1386-369XArticle

PREEMPTIVE ONLINE SCHEDULING WITH REORDERINGDOSA, Gyorgy; EPSTEIN, Leah.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 21-49, issn 0895-4801, 29 p.Article

Improved randomized results for the interval selection problemEPSTEIN, Leah; LEVIN, Asaf.Theoretical computer science. 2010, Vol 411, Num 34-36, pp 3129-3135, issn 0304-3975, 7 p.Article

Optimal online algorithms for multidimensional packing problemsEPSTEIN, Leah; VAN STEE, Rob.SIAM journal on computing (Print). 2006, Vol 35, Num 2, pp 431-448, issn 0097-5397, 18 p.Article

Vector assignment schemes for asymmetric settingsEPSTEIN, Leah; TASSA, Tamir.Acta informatica. 2006, Vol 42, Num 6-7, pp 501-514, issn 0001-5903, 14 p.Article